MS&E-319: Approximation Algorithms
ثبت نشده
چکیده
Suppose we have m identical machines and n jobs. For each job i, we are given ti, the time it takes to process it on one of the machines. Our goals is to assign the jobs to machines in a balanced way. Let Aj be the set of jobs assigned to machine j. Define Tj = ∑ i∈Aj ti to be the load of machine j. The makespan of an assignment is the maximum load on a machine (i.e. maxi Ti). The goal of load balancing is to find an assignment of jobs to machines that minimizes the makespan. A “greedy” approach, Algorithm 2 is to iteratively assign each job to the machine with the smallest load.
منابع مشابه
Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems
Given an undirected weighted graph G = (V,E), a set C1, C2, . . . , Ck of cycles is called a cycle cover of V ′ if V ′ ⊂ ∪i=1V (Ci) and its cost is the maximum weight of the cycles. The Min-Max Cycle Cover Problem(MMCCP) is to find a minimum cost cycle cover of V with at most k cycles. The Rooted Min-Max Cycle Cover Problem(RMMCCP) is to find a minimum cost cycle cover of V \D with at most k cy...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملApproximation Algorithms Inspired by Kernelization Methods
Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximation-preserving reductions, akin to the notion of parameterized reductions. We exemplify this method to o...
متن کاملLinear-Time Approximation Algorithms for Unit Disk Graphs
Numerous approximation algorithms for unit disk graphs have been proposed in the literature, exhibiting sharp trade-offs between running times and approximation ratios. We propose a method to obtain linear-time approximation algorithms for unit disk graph problems. Our method yields linear-time (4 + ε)-approximations to the maximum-weight independent set and the minimum dominating set, as well ...
متن کاملApproximation Algorithms for k-Connected Graph Factors
Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of minimum weight with connectivity requirements. For the case of k-edge-connectedness, we present approximation algorithms that achieve constant approximation ratios for all d ≥...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016